n = int(input())
colors = ['R', 'O', 'Y', 'G', 'B', 'I', 'V']
ans = ''
for i in range(n-3):
ans += colors[i % 4]
ans += 'BIV'
print(ans)
#define ll long long
#define MAXN 200010
#define INF 0x3f3f3f3f
#include <bits/stdc++.h>
using namespace std;
int main(){
#ifdef _DEBUG
freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
#endif
#define int ll
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
n -= 7;
string s = "ROYGBIV";
string m = "GBIV";
for (int i = 0; i < n; ++i) {
s += m[i % 4];
}
cout << s << endl;
return 0;
}144. Binary Tree Preorder Traversal | 137. Single Number II |
130. Surrounded Regions | 129. Sum Root to Leaf Numbers |
120. Triangle | 102. Binary Tree Level Order Traversal |
96. Unique Binary Search Trees | 75. Sort Colors |
74. Search a 2D Matrix | 71. Simplify Path |
62. Unique Paths | 50. Pow(x, n) |
43. Multiply Strings | 34. Find First and Last Position of Element in Sorted Array |
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |
127. Word Ladder | 123. Best Time to Buy and Sell Stock III |
85. Maximal Rectangle | 84. Largest Rectangle in Histogram |